Class DijkstraShortestPath

java.lang.Object
edu.claflin.finder.algo.Algorithm
edu.claflin.finder.algo.shortestpath.DijkstraShortestPath
All Implemented Interfaces:
Processable<Graph,Graph>

public class DijkstraShortestPath extends Algorithm
  • Constructor Details

    • DijkstraShortestPath

      public DijkstraShortestPath(ArgumentsBundle bundle)
      Public Constructor for creating an Algorithm.
      Parameters:
      bundle - the ArgumentsBundle containing the arguments for the Algorithm object.
  • Method Details

    • toString

      public String toString()
      Overrides:
      toString in class Object
    • process

      public ArrayList<Graph> process(Graph graph)
      Description copied from interface: Processable
      Processes data.
      Parameters:
      graph - the T type object to process.
      Returns:
      the S type object array produced by the processing.
    • closestReachableUnvisited

      private Node closestReachableUnvisited(HashMap<Node,Double> shortestPathMap, Graph graph, Set<String> visited)
    • getWeight

      private double getWeight(List<Edge> E)